Analyticity, Balance and Non-admissibility of $$\varvec{Cut}$$ Cut in Stoic Logic
نویسندگان
چکیده
منابع مشابه
Formalised Cut Admissibility for Display Logic
We use a deep embedding of the display calculus for relation algebras ÆRA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for ÆRA. Unlike other “implementations”, we explicitly formalise the structural induction in Isabelle/HOL and believe this to be the first full formalisation of cutadmissibility in the presence of explicit structural rules.
متن کاملCut Admissibility by Saturation
Deduction modulo is a framework in which theories are integrated into proof systems such as natural deduction or sequent calculus by presenting them using rewriting rules. When only terms are rewritten, cut admissibility in those systems is equivalent to the confluence of the rewriting system, as shown by Dowek, RTA 2003, LNCS 2706. This is no longer true when considering rewriting rules involv...
متن کاملConsistency Implies Cut Admissibility
For any finite and consistent first-order theory, we can find a presentation as a rewriting system that enjoys cut admissibility. Since proofs are rarely built without context, it is essential to develop methods that are adapted to search for proofs in theories. For instance, SMT provers provide efficient tools. Nevertheless, they are restricted to some particular theories, such as linear arith...
متن کاملFormalising Proofs of Cut Admissibility
In this document, we look at two methods of formalising a proof of Cut admissibility using Isabelle. The first uses sets of formulae for the contexts, and the second uses multisets. We have, where possible, hidden the particular representation of context behind some common notation. We begin with the multiset approach, and then consider the set approach. The general framework used for both was ...
متن کاملAdmissibility of Cut in Coalgebraic Logics
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of the (already known) interpolation property for coalition logic and establish the interpolation property for the conditional logics CK and CK Id .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2018
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-018-9797-5